Imprecise probabilities , bets and functional analytic methods in Lukasiewicz logic ∗

نویسندگان

  • Martina Fedel
  • Klaus Keimel
  • Franco Montagna
  • Walter Roth
چکیده

In his foundation of probability theory, Bruno de Finetti devised a betting scheme where a bookmaker offers bets on the outcome of events φ occurring in the future. He introduced a criterion for coherent bookmaking, and showed that coherent betting odds are given by some probability distribution. While de Finetti dealt with yes-no events and boolean propositional logic, Mundici generalized the theory to the continuous spectrum events formalized within Lukasiewicz logic. Both de Finetti and Mundici assume that the bookmaker/bettor roles can be interchanged. In this paper we deal with a more realistic situation, dropping the reversibility assumption. Working in the framework of Lukasiewicz logic, we introduce a coherence criterion for non-reversible bookmaking. Our main tool is given by ’imprecise probabilities’, which are formulated in terms either of compact convex sets of probabilities or equivalently in terms of suitable sublinear functionals (see Section 5). Our main result is Theorem 8.3 which states that our coherence criterion arises from imprecise probabilities just as de Finetti’s criterion arises from probabilities. Throughout, we will work with MV-algebras. They play the same role for Lukasiewicz logic as Boolean algebras play for classical logic. Unital abelian lattice-ordered groups will provide an intermediate structure: while being categorically equivalent to MV-algebras, they are more akin to the Banach space C(X). Functional analytic methods, developed in Section 6, are used for the proof of our main result.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truth Value Intervals, Bets, and Dialogue Games

Fuzzy logics in Zadeh’s ‘narrow sense’ (Zadeh, 1988), i.e., truth functional logics referring to the real closed unit interval [0,1] as set of truth values, are often motivated as logics for ‘reasoning with imprecise notions and propositions’ (see, e.g., (Hájek, 1998)). However the relation between these logics and theories of vagueness, as discussed in a prolific discourse in analytic philosop...

متن کامل

SOFT TOPOLOGY AND SOFT PROXIMITY AS FUZZY PREDICATES BY FORMULAE OF LUKASIEWICZ LOGIC

In this paper, based in the L ukasiewicz logic, the definition offuzzifying soft neighborhood structure and fuzzifying soft continuity areintroduced. Also, the fuzzifying soft proximity spaces which are ageneralizations of the classical soft proximity spaces are given. Severaltheorems on classical soft proximities are special cases of the theorems weprove in this paper.

متن کامل

REVISITING GILES’S GAME Reconciling Fuzzy Logic and Supervaluation∗

We explain Giles’s characterization of Lukasiewicz logic via a dialogue game combined with bets on results of experiments that may show dispersion. The game is generalized to other fuzzy logics and linked to recent results in proof theory. We argue that these results allow one to place t-norm based fuzzy logics in a common framework with supervaluation as a theory of vagueness.

متن کامل

Belief Functions on Formulas in Lukasiewicz Logic

Belief functions are generalized to formulas in Lukasiewicz logic. It is shown that they generalize probabilities on formulas (so-called states) and that they are completely monotone mappings with respect to the lattice operations.

متن کامل

Probabilistic and Truth-functional Many-valued Logic Programming Justus-liebig- Universit at Gieeen Ifig Research Report Probabilistic and Truth-functional Many-valued Logic Programming

We introduce probabilistic many-valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex than classical logic programming. More precisely, some deduction problems that are P-complete for classical logic programs are shown to be co-NP-complete for probabilistic many-v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011